By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 35, Issue 2, pp. 259-517

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

A Parametrized Algorithm for Matroid Branch-Width

Petr Hlinený

pp. 259-277

BibTeX  Abstract Full Text:  PDF

On the Performance of Greedy Algorithms in Packet Buffering

Susanne Albers and Markus Schmidt

pp. 278-304

BibTeX  Abstract Full Text:  PDF

Analysis of Link Reversal Routing Algorithms

Costas Busch and Srikanta Tirthapura

pp. 305-326

BibTeX  Abstract Full Text:  PDF

Two-Way Chaining with Reassignment

Ketan Dalal, Luc Devroye, Ebrahim Malalla, and Erin McLeish

pp. 327-340

BibTeX  Abstract Full Text:  PDF

Cache-Oblivious B-Trees

Michael A. Bender, Erik D. Demaine, and Martin Farach-Colton

pp. 341-358

BibTeX  Abstract Full Text:  PDF

A Powerful LL(k) Covering Transformation

Gyung-Ok Lee and Kwang-Moo Choe

pp. 359-377

BibTeX  Abstract Full Text:  PDF

Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

Roberto Grossi and Jeffrey Scott Vitter

pp. 378-407

BibTeX  Abstract Full Text:  PDF

Recognizing More Unsatisfiable Random k-SAT Instances Efficiently

Joel Friedman, Andreas Goerdt, and Michael Krivelevich

pp. 408-430

BibTeX  Abstract Full Text:  PDF

Optimal Online Algorithms for Multidimensional Packing Problems

Leah Epstein and Rob van Stee

pp. 431-448

BibTeX  Abstract Full Text:  PDF

Strictly Nonblocking WDM Cross-connects

April Rasala and Gordon Wilfong

pp. 449-485

BibTeX  Abstract Full Text:  PDF

Strong Spatial Mixing with Fewer Colors for Lattice Graphs

Leslie Ann Goldberg, Russell Martin, and Mike Paterson

pp. 486-517

BibTeX  Abstract Full Text:  PDF